Notes on “Logarithmic Lower Bounds in the Cell–Probe Model”
نویسنده
چکیده
fi(xi, xi−1, . . . , x1), for i = 1, . . . , n, where fi’s are from a fixed set Ops. – Most importantly, only xi is explicitly passed to the i-th function. The algorithm must store x1, . . . , xi−1 (or some functions thereof) in memory so it can access them when computing fi. – The idea is to arrange the values in some clever way (the data structure) in order to make computing the fi (and updating memory to contain xi) efficient. • What do we mean by “efficient”?
منابع مشابه
Logarithmic Lower Bounds in the Cell-Probe Model
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an amortized randomized Ω(lgn) lower bound per operation for several data structural problems on n elements, including partial sums, dynamic connectivity among disjoint paths (or a forest or a graph), and several other dynamic graph problems (by simple reductions). Such ...
متن کاملOn Dynamic Bit-Probe Complexity
This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg n ) ). Surpassing Ω(lg n) was listed as the first open problem in a survey by Miltersen. • We prove a bound of Ω( lg n lg lg lg n ) for maintaining partial sums in Z/2Z. Previously, the known bou...
متن کاملLogarithmic Cell Probe Lower Bounds for Non-Deterministic Static Data Structures
In this paper, we present a new technique for proving static cell probe lower bounds. Our technique takes the field of static cell probe lower bounds one step further, by yielding the highest lower bound to date for any explicit problem, namely t = Ω((w− lg n)/ lg(S/n)), where w is the cell size in bits, n the input size, S the space of the data structure in number of cells, and t the cell prob...
متن کاملLower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
We give a number of new lower bounds in the cell probe model with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations. We study the signed prefix sum problem: given a string of length n of 0s and signed 1s, compute the sum of its ith prefix during updates. We show a lower bound of Ω(logn/ log logn) time per opera...
متن کاملA Survey of Communication Complexity for Proving Lower Bound of Data Structures in Cell-Probe Model
Proving lower bounds for computational problem is always a challenging work. In this survey, we will present some techniques for proving lower bound of data structures in cellprobe model. There is a natural relationship between cell-probe model and communication complexity, so many proofs of lower bound in cell-probe model are related to communication complexity. In communication complexity, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010